/*自己写的，直接在循环中计算左右两部分的和，比较它们是否相等*/

#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 100000;
int n, a[MAXN], sum = 0, l = 0, r = 0, ans = 0;


int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    for (int i = 1; i <= n-1; i++)
    {
        l += a[i];
        r = sum - l;
        if (l == r)
            ans++;
    }
    cout << ans << endl;
    return 0;
}


/*使用了前缀和数组来计算数组的累加和，然后通过比较两部分和是否相等来确定分割点*/
/*
#include <bits/stdc++.h>

using namespace std;
int n, a[100000], sum[100000], ans = 0;
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		sum[i] = sum[i - 1] + a[i];
		cout << "sum[i]=" << sum[i] << endl;
	}

	cout << "Calc..." << endl;

	for (int i = 2; i <= n; i++)
	{
		if (sum[n] - sum[i - 1] == sum[i - 1])
		{
			ans++;
			cout << "i=" << i << " n=" << n << " sum[n]=" << sum[n] << " sum[i-1]=" << sum[i - 1] << endl;
		}
	}
	cout << "ans=" << endl;
	cout << ans << endl;
	return 0;
}
*/